On Visibility Representations of Non-Planar Graphs
نویسندگان
چکیده
A rectangle visibility representation (RVR) of a graph consists of an assignment of axisaligned rectangles to vertices such that for every edge there exists a horizontal or vertical line of sight between the rectangles assigned to its endpoints. Testing whether a graph has an RVR is known to be NP-hard. In this paper, we study the problem of finding an RVR under the assumption that an embedding in the plane of the input graph is fixed and we are looking for an RVR that reflects this embedding. We show that in this case the problem can be solved in polynomial time for general embedded graphs and in linear time for 1-plane graphs (i.e., embedded graphs having at most one crossing per edge). The linear time algorithm uses a precise list of forbidden configurations, which extends the set known for straight-line drawings of 1-plane graphs. These forbidden configurations can be tested for in linear time, and so in linear time we can test whether a 1-plane graph has an RVR and either compute such a representation or report a negative witness. Finally, we discuss some extensions of our study to the case when the embedding is not fixed but the RVR can have at most one crossing per edge.
منابع مشابه
1-Visibility Representations of 1-Planar Graphs
A visibility representation is a classical drawing style of planar graphs. It displays the vertices of a graph as horizontal vertexsegments, and each edge is represented by a vertical edge-segment touching the segments of its end vertices; beyond that segments do not intersect. We generalize visibility to 1-visibility, where each edge(vertex-) segment crosses at most one vertex(edge-) segment. ...
متن کاملOn a Visibility Representation of Graphs
We give a visibility representation of graphs which extends some very well-known representations considered extensively in the literature. Concretely, the vertices are represented by a collection of parallel hyper-rectangles in R and the visibility is orthogonal to those hyperrectangles. With this generalization, we can prove that each graph admits a visibility representation. But, it arises th...
متن کاملArea Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate the computational complexity of constructing minimum area grid visibility representations of hierarchically planar graphs. Firstly, we provide a quadratic algorithm that minimizes the drawing area with respect to a xed planar em...
متن کاملPii: S0925-7721(99)00018-8
This paper considers representations of graphs as rectangle-visibility graphs and as doubly linear graphs. These are, respectively, graphs whose vertices are isothetic rectangles in the plane with adjacency determined by horizontal and vertical visibility, and graphs that can be drawn as the union of two straight-edged planar graphs. We prove that these graphs have, with n vertices, at most 6n−...
متن کاملVisibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adjacent nodes are vertically visible to each other. If G is a plane graph, i.e., a planar graph equipped with a planar embedding, a visibility representation of G has the additional requirement of reflecting the given pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016